Fictitious play in coordination games

نویسندگان

  • Aner Sela
  • Dorothea Herreiner
چکیده

We study the Fictitious Play process with bounded and unbounded recall in pure coordination games for which failing to coordinate yields a payoff of zero for both players. It is shown that every Fictitious Play player with bounded recall may fail to coordinate against his own type. On the other hand, players with unbounded recall are shown to coordinate (almost surely) against their own type as well as against players with bounded recall. This implies that a FP player’s realized average utility is (almost surely) at least as large as his minmax payoff in 2x2 coordination games. JEL Classification Numbers: C72, D83.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Nonconvergence of Fictitious Play in Coordination Games

It is shown by example that learning rules of the fictitious play type fail to converge in certain kinds of coordination games. Variants of fictitious play in which past actions are eventually forgotten and that incorporate small stochastic perturbations are better behaved for this class of games: over the long run, players coordinate with probability one. Journal of Economic Literature Classif...

متن کامل

Coordination between a sophisticated and fictitious player

Successful coordination is a common and important social problem. Achieving it relies on the players’ ability to accurately anticipate future choices from known information. Individuals may not only lack this cognitive ability, but differ in it. Fictitious Play is an adaptive behavior where a myopic best response to the historical play of an opponent is selected. I consider the interaction betw...

متن کامل

Examples 1.1 a Coordination Game

In the last lecture, we defined several variants of fictitious play. In this lecture we will discuss some examples that reveal the behavior of fictitious play, and then recap the key results on convergence. We will also prove convergence in two cases: two-player zero sum games under the PCTFP dynamic, and N -player games of identical interest under the CTFP dynamic. We use the same notation and...

متن کامل

Dynamic Opponent Modelling in Fictitious Play

Distributed optimisation can be formulated as an n player coordination game. One of the most common learning techniques in game theory is fictitious play and its variations. However fictitious play is founded on an implicit assumption that opponents’ strategies are stationary. In this paper we present a new variation of fictitious play in which players predict opponents’ strategy using a partic...

متن کامل

On Best-Response Dynamics in Potential Games

This work studies the convergence properties of continuous-time fictitious play in potential games. It is shown that in almost every potential game and for almost every initial condition, fictitious play converges to a pure-strategy Nash equilibrium. We focus our study on the class of regular potential games; i.e., the set of potential games in which all Nash equilibria are regular. As byproduc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Game Theory

دوره 28  شماره 

صفحات  -

تاریخ انتشار 1999